20 04 the Maximal { − 1 , 1 } - Determinant of Order 15
نویسنده
چکیده
We study the question of finding the maximal determinant of matrices of odd order with entries ±1. The most general upper bound on the maximal determinant, due to Barba, can only be achieved when the order is the sum of two consecutive squares. It is conjectured that the bound is always attained in such cases. Apart from these, only in orders 3, 7, 9, 11, 17 and 21 has the maximal value been established. In this paper we confirm the results for these orders, and add order 15 to the list. We follow previous authors in exhaustively searching for candidate Gram matrices having determinant greater than or equal to the square of a known lower bound on the maximum. We then attempt to decompose each candidate as the product of a {−1, 1}-matrix and its transpose. For order 15 we find four candidates, all of Ehlich block form, two having determinant (105 ·35 ·214)2 and the others determinant (108 ·35 ·214)2. One of the former decomposes (in an essentially unique way) while the remaining three do not. This result proves a conjecture made independently by W. D. Smith and J. H. E. Cohn. We also use our method to compute improved upper bounds on the maximal determinant in orders 29, 33, and 37, and to establish the range of the determinant function of {−1, 1}-matrices in orders 9 and 11.
منابع مشابه
Finding many D-optimal designs by randomised decomposition and switching
The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant H(n) of a square {+1,−1}-matrix of given order n. Such a matrix with maximum determinant is called a Doptimal design of order n. We consider some cases where n 6= 0 mod 4, so the Hadamard bound is not attainable, but bounds due to Barba or Ehlich and Wojtas may be attainable. If R is a matrix with maximal (or c...
متن کاملJa n 20 04 CRITICAL LATTICES , ELLIPTIC CURVES AND THEIR POSSIBLE DYNAMICS
We present a combinatorial geometry and dynamical systems framework for the investigation and proof of the Minkowski conjecture about critical determinant of the region |x|p+ |y|p < 1, p > 1. The application of the framework may drastically reduce the investigation of sufficiently smooth real functions of many variables. Incidentally, we establish connections between critical lattices, dynamica...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملLine 803 (12/11/16) -- Metro Rail - Metro Green Line - RailEastbound to Norwalk - Westbound to Redondo Beach
— — — — — — — — — — 3:36A 3:42A 3:58A 4:08A — 3:53A 3:55A 3:57A 3:59A 4:02A 4:05A 4:07A 4:09A 4:11A 4:13 4:16 4:21 4:25 — 4:21 4:23 4:25 4:27 4:30 4:33 4:35 4:37 4:39 4:41 4:44 4:49 4:53 4:31A 4:33 4:35 4:37 4:39 4:42 4:45 4:47 4:49 4:51 5:00 5:03 5:08 5:12 4:50 4:52 4:54 4:56 4:58 5:01 5:04 5:06 5:08 5:10 5:12 5:15 5:20 5:24 5:03 5:05 5:07 5:09 5:11 5:14 5:17 5:19 5:21 5:23 5:25 5:28 5:33 5:37...
متن کاملA Life ' s Work on Hadamard Matrices ,
1 Hadamard matrices in Space Communications One hundred years ago, in 1893, Jacques Hadamard 21] found square matrices of orders 12 and 20, with entries 1, which had all their rows (and columns) orthogonal. These matrices, X = (x ij), satissed the equality of the following inequality jdet Xj 2 n i=1 n X j=1 jx ij j 2 and had maximal determinant. Hadamard actually asked the question of matrices ...
متن کامل